From the Complex NP Constraint to everything: On deep extractions across categories

نویسنده

  • Željko Bošković
چکیده

The article establishes a new generalization concerning domains from which extraction is possible. Taking as the starting point the well-known difference between NPs and VPs regarding extraction, where extraction from Complex NPs is not possible while extraction from Complex VPs is possible, the article argues that the former represents a pervasive pattern found in many contexts, the latter being highly exceptional. More precisely, extraction is impossible not only from clausal but all complements of nouns. Furthermore, it is impossible from complements of prepositions and adjectives as well as ergative verbs. A deduction of the impossibility of extraction from the complements of lexical heads (other than non-ergative verbs) is proposed based on a new approach to phases (i.e. to what counts as a phase) and the Phase-Impenetrability Condition, as well as a particular implementation of Chomsky’s (2013) labeling algorithm. The analysis is extended to the Subject Condition effect and the that-trace effect.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deep Unsupervised Domain Adaptation for Image Classification via Low Rank Representation Learning

Domain adaptation is a powerful technique given a wide amount of labeled data from similar attributes in different domains. In real-world applications, there is a huge number of data but almost more of them are unlabeled. It is effective in image classification where it is expensive and time-consuming to obtain adequate label data. We propose a novel method named DALRRL, which consists of deep ...

متن کامل

Information Structure Constraints and Complex NP islands in Chinese

This paper proposes that the complex NP island phenomena in Chinese wh-interrogatives receive a functional-pragmatic explanation. I argue the treatments of Chinese islands in terms of movement constraints in transformational framework failed to address the interpretational distinctiveness associated with different categories of wh-words. Island facts follow naturally from an independently motiv...

متن کامل

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

متن کامل

Extractions from Relative Clauses in Swedish as Self-answering Questions

This restriction on RCs has been regarded as an instantiation of the so called Complex NP Constraint (henceforth: CNPC) which was originally introduced by Ross (1967). According to this constraint, no internal material must be extracted out of a DP . By DP internal material, one commonly assumes attributes or subparts of attributes. DPs, therefore, are islands for movement. Regarding RCs as tru...

متن کامل

An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015